#include <bits/stdc++.h>
using x64 = long long;
int main() {
x64 x, y, m;
std::cin >> x >> y >> m;
if (x > y) std::swap(x, y);
if (y >= m) {
std::cout << 0 << std::endl;
}
else {
if (y <= 0) {
std::cout << -1 << std::endl;
}
else {
x64 ctr = 0;
if (x < 0) {
ctr = (-x + y - 1) / y;
x += ctr * y;
}
while (y < m) {
x += y;
if (x > y) std::swap(x, y);
ctr++;
}
std::cout << ctr << std::endl;
}
}
}
1702B - Polycarp Writes a String from Memory | 1701A - Grass Field |
489C - Given Length and Sum of Digits | 886B - Vlad and Cafes |
915A - Garden | 356A - Knight Tournament |
1330A - Dreamoon and Ranking Collection | 1692B - All Distinct |
1156C - Match Points | 1675A - Food for Animals |
1328C - Ternary XOR | 1689A - Lex String |
1708B - Difference of GCDs | 863A - Quasi-palindrome |
1478A - Nezzar and Colorful Balls | 1581B - Diameter of Graph |
404A - Valera and X | 908A - New Year and Counting Cards |
146A - Lucky Ticket | 1594C - Make Them Equal |
1676A - Lucky | 1700B - Palindromic Numbers |
702C - Cellular Network | 1672C - Unequal Array |
1706C - Qpwoeirut And The City | 1697A - Parkway Walk |
1505B - DMCA | 478B - Random Teams |
1705C - Mark and His Unfinished Essay | 1401C - Mere Array |